package com.situ.mall.suanfa;

import java.util.*;

public class Demo3 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            int N = sc.nextInt();
            int T = sc.nextInt();
            int M = sc.nextInt();

            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = sc.nextInt();
            }
            Arrays.sort(H);
            //二分查找
            int low = 0;
            int high = H[N - 1];
            int mid = low;
            while (low < high) {
                mid = (low + high) >>> 2;
                if (isSolution(mid, N, T, M, H)) {
                    //左半部分
                    high = mid;
                } else {
                    //右半部分
                    low=mid+1;
                }
            }
            System.out.println(low);
        }

    }

    private static boolean isSolution(int X, int N, int T, int M, int[] H) {
        int count=0;
        Queue<Integer> maxHeap = new PriorityQueue<>(N, Comparator.reverseOrder());
        for (int i = 0; i < H.length; i++) {

            maxHeap.add(H[i]);

        }
        return true;

    }
}
